Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
551	Graph-Based N-gram Language Identification on Short Texts Erik Tromp Mykola Pechenizkiy Department of Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB, Eindhoven, The Netherlands Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-05-13 09:24:15 Computational linguistics Science N-gram Language identification NL Graph SL FO Theoretical computer science Natural language processing Complexity classes
552	Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar Carnegie Mellon University Deepayan Chakrabarti Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-03-01 02:05:39 Network theory Shortest path problem Randomized algorithm Connectivity Graph theory Networks Theoretical computer science Mathematics Computational complexity theory
553	Newton’s Method Steve Smale The expression is a mathematical description of Newton’s Method. Long before Newton, the concept already was used by the Greeks for finding the square root of a positive number. Since Newt Add to Reading List Source URL: www.gregkucera.com Language: English - Date: 2015-01-07 20:36:16 Applied mathematics Polynomial Computational complexity theory NP-complete Fundamental theorem of algebra Algorithm Carl Friedrich Gauss NP P Mathematics Theoretical computer science Complexity classes
554	Using Relevance Queries for Identification of Read-Once Functions Add to Reading List Source URL: www.mpi-sws.org Language: English - Date: 2013-02-16 12:55:16 Computational complexity theory Decision tree model Function FO Quantum algorithm Theoretical computer science Mathematics Applied mathematics
555	05391 Abstracts Collection Algebraic and Numerical Algorithms and Computer-assisted Proofs Dagstuhl Seminar 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2006-01-31 09:29:16 Computer algebra Complexity classes Numerical analysis Algorithm Mathematical logic Polynomial Gröbner basis Computational complexity theory NP Theoretical computer science Applied mathematics Mathematics
556	Algorithms Lecture 4: Efficient Exponential-Time Algorithms [Fa’14] Wouldn’t the sentence “I want to put a hyphen between the words Fish and And and And and Chips in my Fish-And-Chips sign.” have been clearer if Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:22 NP-complete problems Analysis of algorithms Graph coloring Graph theory Time complexity Boolean satisfiability problem Randomized algorithm MAXEkSAT One-in-three 3SAT Theoretical computer science Computational complexity theory Mathematics
557	Energy-Aware Service Allocation Damien Borgettoa , Henri Casanovab , Georges Da Costaa , Jean-Marc Piersona b a IRIT, University of Toulouse, Toulouse, France Department of Information and Computer Sciences University of Add to Reading List Source URL: navet.ics.hawaii.edu Language: English - Date: 2012-06-26 08:38:20 Operations research Computational complexity theory Convex optimization Linear programming Greedy algorithm Algorithm Reduction Bin packing problem Theoretical computer science Mathematics Applied mathematics
558	Algorithms Lecture 28: Lower Bounds [Fa’13] It was a Game called Yes and No, where Scrooge’s nephew had to think of something, and the rest must find out what; he only answering to their questions yes or no, as the Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:15 Analysis of algorithms Sorting algorithms Computational complexity theory Time complexity Decision tree model Binary search algorithm Algorithm Randomized algorithm Quicksort Theoretical computer science Mathematics Applied mathematics
559	PDF Document Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-07-05 10:27:28 Constraint programming Relational model Conjunctive query Database theory SQL Matching FO Relational algebra Decomposition method Theoretical computer science Computing Computational complexity theory
560	Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139 Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2010-05-13 09:33:41 Structural complexity theory Complexity classes Models of computation Lance Fortnow Probabilistic complexity theory Interactive proof system IP Bounded-error probabilistic polynomial Probabilistic Turing machine Theoretical computer science Computational complexity theory Applied mathematics

UPDATE